Pheromone-based In-Network Processing for wireless sensor network monitoring systems

Monitoring spatio-temporal continuous fields using wireless sensor networks (WSNs) has emerged as a novel solution. An efficient data-driven routing mechanism for sensor querying and information gathering in large-scale WSNs is a challenging problem. In particular, we consider the case of how to query the sensor network information with the minimum energy cost in scenarios where a small subset of sensor nodes has relevant readings. In order to deal with this problem, we propose a Pheromone-based In-Network Processing (PhINP) mechanism. The proposal takes advantages of both a pheromone-based iterative strategy to direct queries towards nodes with relevant information and query- and response-based in-network filtering to reduce the number of active nodes. Additionally, we apply reinforcement learning to improve the performance. The main contribution of this work is the proposal of a simple and efficient mechanism for information discovery and gathering. It can reduce the messages exchanged in the network, by allowing some error, in order to maximize the network lifetime. We demonstrate by extensive simulations that using PhINP mechanism the query dissemination cost can be reduced by approximately 60% over flooding, with an error below 1%, applying the same in-network filtering strategy.Fil: Riva, Guillermo Gaston. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Universidad Tecnológica Nacional; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba; ArgentinaFil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; Argentin

Congestion management techniques for disruption-tolerant satellite networks

Delay and disruption-tolerant networks are becoming an appealing solution for extending Internet boundaries toward challenged environments where end-to-end connectivity cannot be guaranteed. In particular, satellite networks can take advantage of a priori trajectory estimations of nodes to make efficient routing decisions. Despite this knowledge is already used in routing schemes such as contact graph routing, it might derive in congestion problems because of capacity overbooking of forthcoming connections (contacts). In this work, we initially extend contact graph routing to provide enhanced congestion mitigation capabilities by taking advantage of the local traffic information available at each node. However, since satellite networks data generation is generally managed by a mission operation center, a global view of the traffic can also be exploited to further improve the latter scheme. As a result, we present a novel strategy to avoid congestion in predictable delay- and disruption-tolerant network systems by means of individual contact plans. Finally, we evaluate and compare the performance improvement of these mechanisms in a typical low Earth orbit satellite constellation.Fil: Madoery, Pablo Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; ArgentinaFil: Fraire, Juan Andres. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; Argentina. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; ArgentinaFil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; Argentina. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentin

On route table computation strategies in Delay-Tolerant Satellite Networks

Delay-Tolerant Networking (DTN) has been proposed for satellite networks with no expectation of continuous or instantaneous end-to-end connectivity, which are known as Delay-Tolerant Satellite Networks (DTSNs). Path computation over large and highly-dynamic yet predictable topologies of such networks requires complex algorithms such as Contact Graph Routing (CGR) to calculate route tables, which can become extremely large and limit forwarding performance if all possible routes are considered. In this work, we discuss these issues in the context of CGR and propose alternatives to the existing route computation scheme: first-ending, first-depleted, one-route, and per-neighbor strategies. Simulation results over realistic DTSN constellation scenarios show that network flow metrics and overall calculation effort can be significantly improved by adopting these novel route table computation strategies.Fil: Fraire, Juan Andres. Universidad Nacional de Córdoba; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; ArgentinaFil: Madoery, Pablo Gustavo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; Argentina. Universidad Nacional de Córdoba; ArgentinaFil: Charif, Amir (EXT). Commissariat A Energie Atomique; FranciaFil: Finochietto, Jorge Manuel. Universidad Nacional de Córdoba; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; Argentin

Routing-aware fair contact plan design for predictable delay tolerant networks

Delay tolerant networks (DTNs) have become a promising solution for extending Internet boundaries to challenged environments such as satellite constellations. In this context, strategies to exploit scarce communication opportunities, while still considering device and application constraints, are still to be investigated to enable the actual deployment of these networks. In particular, the Contact Graph Routing (CGR) scheme has been proposed as it takes advantage of the contact plan, which comprises all future contacts among nodes. However, resource constraints can forbid the totality of these contacts to belong to the contact plan; thus, only those which together meet an overall goal shall be selected. In this article, we consider the problem of designing a contact plan that can provide fairness in link assignment and minimal all-to-all route delay; therefore, achieving equal contact opportunities while favoring end-to-end traffic latency. We formalize this by means of a multi-objective optimization model that can be computationally intractable for large topologies; thus, heuristic algorithms are proposed to compute the contact plan in practice. Finally, we analyze general results from these routines and discuss how they can used to provision valuable contact plans for real networks.Fil: Fraire, Juan Andres. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba; ArgentinaFil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba; Argentin

Design challenges in contact plans for disruption-tolerant satellite networks

During the past 20 years, space communications technologies have shown limited progress in comparison to Internet-based networks on Earth. However, a brand new working group of the IETF with focus on DTN promises to extend today's Internet boundaries to embrace disruptive communications such as those seen in space networks. Nevertheless, several challenges need to be overcome before operative DTNs can be deployed in orbit. We analyze the state of the art of effective design, planning, and implementation of the forthcoming network communications opportunities (contacts). To this end, different modeling techniques, system constraints, selection criteria, and methods are reviewed and compared. Finally, we discuss the increasing complexity of considering routing and traffic information to enrich the planning procedure, yielding the need to implement a contact plan computation element to support space DTN operation.Fil: Fraire, Juan Andres. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; ArgentinaFil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados En Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias exactas Físicas y Naturales. Instituto de Estudios Avanzados En Ingeniería y Tecnología; Argentin

Efficient Multicast Bandwidth Allocation in TDM-WDM PONs

paper JThA8

Efficient Multicast Bandwidth Allocation in TDM-WDM PONs

paper JThA8

On Provisioning Strategies in Translucent Elastic Optical Networks with Flexible Regeneration and Superchannel Transmission

Elastic Optical Networks (EONs) can increase the efficiency of already deployed optical fibers thanks to transponders that adjust the modulation format, baud-rate and number of optical carriers to achieve the desired transmission rate, bandwidth and reach. Due to the high cost of these transponders, transparent end-to-end lightpaths are usually desired, which can require a large amount of spectrum as they are provisioned over long distances. In this paper, we consider the case of translucent lightpaths, which make use of flexible regeneration schemes to reduce the amount of required spectrum. We analyze the trade-off between the spectrum usage and the number of transponder devices. In particular, we propose a proactive approach to provision EONs that considers the spectrum availability. Thus, it is possible to explore the referred trade-off with a load- incremental perspective, which may be relevant for network operators. Results show how the proposed approach can increase the supported capacity in the network at the cost of additional transponder devices

On Provisioning Strategies in Translucent Elastic Optical Networks with Flexible Regeneration and Superchannel Transmission

Elastic Optical Networks (EONs) can increase the efficiency of already deployed optical fibers thanks to transponders that adjust the modulation format, baud-rate and number of optical carriers to achieve the desired transmission rate, bandwidth and reach. Due to the high cost of these transponders, transparent end-to-end lightpaths are usually desired, which can require a large amount of spectrum as they are provisioned over long distances. In this paper, we consider the case of translucent lightpaths, which make use of flexible regeneration schemes to reduce the amount of required spectrum. We analyze the trade-off between the spectrum usage and the number of transponder devices. In particular, we propose a proactive approach to provision EONs that considers the spectrum availability. Thus, it is possible to explore the referred trade-off with a load- incremental perspective, which may be relevant for network operators. Results show how the proposed approach can increase the supported capacity in the network at the cost of additional transponder devices